Free groups and ends of graphs
نویسندگان
چکیده
Let X be a connected graph. An automorphism of X is said to be parabolic if it leaves no finite subset of vertices in X invariant and fixes precisely one end of X and hyperbolic if it leaves no finite subset of vertices in X invariant and fixes precisely two ends of X. Various questions concerning dynamics of parabolic and hyperbolic automorphisms
منابع مشابه
On trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملSOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملEnds of groups: a nonstandard perspective
We give a nonstandard treatment of the notion of ends of proper geodesic metric spaces. We then apply this nonstandard treatment to Cayley graphs of finitely generated groups and give nonstandard proofs of many of the fundamental results concerning ends of groups. We end with an analogous nonstandard treatment of the ends of relatively Cayley graphs, that is Cayley graphs of cosets of finitely ...
متن کاملThe Fundamental Group of Locally Finite Graphs with Ends
We characterize the fundamental group of a locally finite graph G with ends, by embedding it canonically as a subgroup in the inverse limit of the free groups π1(G ′) with G′ ⊆ G finite. As an intermediate step, we characterize π1(|G|) combinatorially as a group of infinite words.
متن کاملContext - Free Languages , Groups , the Theory of Ends , Second - Order Logic , Tiling Problems , Cellular Automata , and Vector Addition Systems
It turns out that there exists a surprising connection between certain ideas from the areas listed in the title. In this announcement we try to briefly outline the connection and to state our principal results. Very roughly, we use concepts from formal language theory, group theory, and the theory of ends to investigate a class of graphs which we call context-free graphs. Using the results obta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008